Curvature and Computation
نویسنده
چکیده
When undergraduates ask me what geometric group theorists study, I describe a theorem due to Gromov which relates the groups with an intrinsic geometry like that of the hyperbolic plane to those in which certain computations can be efficiently carried out. In short, I describe the close but surprising connection between negative curvature and efficient computation. This theorem was one of the clearest early indications that applying a metric perspective to traditional group theory problems might lead to new and important insights. The theorem I want to discuss asserts that there is a close relationship between two collections of groups: one collection is defined geometrically and the other is defined computationally. The first section describes the relevant geometric and topological ideas, the second discusses the key algebraic and computational concepts, and the short final section describes the relationship between them. An informal style, similar to the one I use when answering this question face-toface, is maintained throughout. 1. Geometry and topology The first thing to highlight is that there is a close relationship between groups and topological spaces. More specifically, to each connected topological space X there is an associated group G called its fundamental group and absolutely every group arises in this way (in the sense that for each group G one can construct a topological space X whose fundamental group is isomorphic to G). Because of this connection and because spaces with isomorphic fundamental groups share many key properties, we can use the topology of the space X to understand the algebraic structure of its fundamental group G. Fundamental groups. In order to make this discussion as accessible as possible, here is a quick sketch of the basic idea behind the notion of a fundamental group. As an initial attempt, one could try to form a group out of a space by using the paths in the space as our elements Date: November 25, 2014. Partial support by the National Science Foundation is gratefully acknowledged.
منابع مشابه
Parallel Symbolic Computation of Curvature Invariants in General Relativity
We present a practical application of parallel symbolic computation in General Relativity: the calculation of curvature invariants for large dimension. We discuss the structure of the calculations, an implementation of the technique and scaling of the computation with spacetime dimension for various invariants. Electronic address: [email protected]
متن کاملComputation of the curvature field in numerical simulation of multiphase flow
An essential ingredient in the simulation of multiphase fluid flow with surface tension is the accurate computation of the interface curvature. Curvature effects become more significant as we decrease the length scale of the problem at hand and thus accurate computation of curvature is especially important when considering microscale multiphase flows. We compared the curvature field calculated ...
متن کاملError-Bounds on Curvature Estimation
Estimation of a digital curve’s curvature at any given point is needed for many tasks in computer vision, be it differential invariants or curvature scale space. However, curvature estimation is known to be very susceptible to noise on the contour. We shall show how noise on the contour affects the relative accuracy of the curvature computation. One interesting result is that, contrary to intui...
متن کاملComputation of Curvatures over Discrete Geometry Using Biharmonic Surfaces
The computation of curvature quantities over discrete geometry is often required when processing geometry composed of meshes. Curvature information is often important for the purpose of shape analysis, feature recognition and geometry segmentation. In this paper we present a method for accurate estimation of curvature on discrete geometry especially those composed of meshes. We utilise a method...
متن کاملConvex Hulls of Bounded Curvature
In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...
متن کاملNew Computation of Normal Vector and Curvature
The local geometric properties such as curvatures and normal vectors play important roles in analyzing the local shape of objects. The result of the geometric operations such as mesh simplification and mesh smoothing is dependent on how to compute the normal vectors and the curvatures of vertices, because there are no exact definitions of the normal vector and the discrete curvature in meshes. ...
متن کامل